Group partitions of minimal size
نویسندگان
چکیده
منابع مشابه
Minimal r-Complete Partitions
A minimal r-complete partition of an integer m is a partition of m with as few parts as possible, such that all the numbers 1, . . . , rm can be written as a sum of parts taken from the partition, each part being used at most r times. This is a generalization of M-partitions (minimal 1-complete partitions). The number of M-partitions of m was recently connected to the binary partition function ...
متن کاملTerm Partitions and Minimal Generalizations of Clauses
Term occurrences of any clause C are determined by their positions. The set of all term partitions defined on subsets of term occurrences of C form a partially ordered set. This poset is isomorphic to the set of all generalizations of C. The structure of this poset can be inferred from the term occurrences in C alone. We can apply these constructions in this poset in machine learning.
متن کاملMinimal connected partitions of the sphere
We consider the soap bubble problem on the sphere S2, which seeks a perimeter-minimizing partition into n regions of given areas. For n = 4, it is conjectured that a tetrahedral partition is minimizing. We prove that there exists a unique tetrahedral partition into given areas, and that this partition has less perimeter than any other partition dividing the sphere into the same four connected a...
متن کاملGroup Actions on Partitions
We introduce group actions on the integer partitions and their variances. Using generating functions and Burnside’s lemma, we study arithmetic properties of the counting functions arising from group actions. In particular, we find a modulo 4 congruence involving the number of ordinary partitions and the number of partitions into distinct parts.
متن کاملA Convex Approach to Minimal Partitions
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem finds a correct numerical approximation of the optimal solution: we give some arguments to explain why it should be so, and also discuss some situation wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2019
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2019.04.017